Diagnosing Multiple Faults in Communicating Finite State Machines
نویسندگان
چکیده
In this paper, we propose a method for diagnostic test derivation when the system specification and implementation are given in the form of two communicating finite state machines and at most a single component machine can be faulty. The method enables to decide if it is possible to identify the faulty machine in the system, once faults have been detected in a system implementation. If this is possible, it also provides tests for locating the faulty component machine. Two examples are used to demonstrate the different steps of the method. The method can also be used for locating faults within a machine when the system specification and implementation are given in the form of a single FSM.
منابع مشابه
Test Generation for a System of Communicating Finite State Machines
A system of communicating finite state machines (SCFSM) is a usual design model of a complicated system composed of multiple communicating components. SCFSM testing usually depends on finite state machine (FSM) testing as an SCFSM can be converted to an equivalent FSM. SCFSM testing, however, should consider the properties of SCFSMs which are different from those of component FSMs. This paper p...
متن کاملDiagnosis of Single Transition Faults in Communicating Finite State Machines
In this paper, we propose a diagnostic algorithm for the case where distributed system specifications (implementations) are given in the form of communicating finite state machines (CFSMs). Such an algorithm localizes the faulty transition in the distributed system once the fault has been detected. It generates, if necessary, additional diagnostic test cases which depend on the observed symptom...
متن کاملDiagnosing Multiple Faults in Finite State Machines
In this paper, we propose a generalized diagnostic algorithm for the case where more than one fault (output and/or transfer) may be present in the transitions of a system represented by a deterministic finite state machine (FSM). If existing faults are detected, this algorithm permits the generation of a minimal set of diagnoses, each of which is formed by a set of transitions (with specific ty...
متن کاملDiagnosing Distributed Systems Modeled by Communicating Finite State Machines
We propose a diagnostic algorithm for the case where a distributed system specification (implementation) is given in the form of communicating finite state machines (CFSMs). Such an algorithm localizes the faulty transition in the distributed system once the fault has been detected. It generates, if necessary, additional diagnostic test cases which depend on the observed symptoms and which perm...
متن کاملDiagnosing Discrete-Event Systems: Extending the "Diagnoser Approach" to Deal with Telecommunication Networks
Detection and isolation of failures in large and complex systems such as telecommunication networks are crucial and challenging tasks. The problem considered here is that of diagnosing the largest French packet switching network. The challenge is to be as efficient as the existing expert system while providing greater generality and flexibility with respect to technological and reconfiguration ...
متن کامل